Dynamic Update with Probabilities
نویسندگان
چکیده
Conditional probabilities Pi(φ | A) describe how agent i’s probability distributions for propositions φ change as new information A comes in. The standard probabilistic calculus describing such changes revolves around Bayes’ Law in case the new information A is factual, concerning some actual situation under investigation. But there are also proposed mechanisms in the literature that deal with non-factual new information A, such as the Jeffrey Update Rule for probabilistic information of the form “Pi(A) = x”. Current dynamic-epistemic logics manipulate formulas [!A]Kiφ describing what agents know or believe after a proposition A has been communicated. Here A may be either about the real world or about information that other agents have. And the most sophisticated modern update systems can even deal with a much greater variety of informative events, such as partial observation, whispers, or lies. Thus, it seems of interest to combine the two perspectives – for reasons of mutual benefit. As always, there are two aspects to the task at hand, which can be called ‘modelling’ and ‘reasoning’. Logical models are designed to capture the informational essence of some informally presented situation. Especially in the area of probability where ‘choosing the right model’ is a task of recognized difficulty, formal guidance can be helpful. Using logical models, we can then describe information update and other processes of interest. Often intertwined with this, agents also invoke general inferences, involving validity in some larger class of situations than just the current one. We will also look at logical validities of the latter sort, high-lighting some general principles of probabilistic reasoning. The paper is organized as follows. The first two sections cover our point of departure: in Section 2 we present static epistemic-probabilistic logic, and in Section 3 we present dynamic epistemic logics. Combinations of probabilistic and dynamic epistemic logics have been proposed before. The systems by Kooi and van Benthem are presented in Section 4. In Section 5 we present the way we would like to model probabilistic updates with varying degrees of generality. In Section 6 we turn to reasoning about probability.
منابع مشابه
UvA - DARE ( Digital Academic Repository ) Dynamic update with probabilities
Current dynamic-epistemic logics model different types of information change in multi-agent scenarios. We generalize these logics to a probabilistic setting, obtaining a calculus for multi-agent update with three natural slots: prior probability on states, occurrence probabilities in the relevant process taking place, and observation probabilities of events. To match this update mechanism, we p...
متن کاملImplicit Probabilities in Update Semantics
Update semantics is both the first ([Karttunen, 1976]) and the final proposal in discourse semantics/dynamic semantics. Update semantics consists in a definition of information states and an update function or relation specified recursively for some update language. All proposals in dynamic semantics and discourse semantics have an interpretation for some instantiation of these two parameters. ...
متن کاملOn the Limited Utility of Auxiliary Information in the List Update Problem
We consider the problem of dynamic reorganization of a linear list, where requests for the elements are generated randomly with xed probabilities. The objective is to obtain the smallest expected cost per access. It has been shown that when no a-priori information is given on the reference probabilities, the Counter Scheme (CS) provides an optimal reorganization rule which applies to all possib...
متن کاملBelief Propagation in Spatiotemporal Graph Topologies for the Analysis of Image Sequences
Belief Propagation (BP) is an efficient approximate inference technique both for Markov Random Fields (MRF) and Dynamic Bayesian Networks (DBN). 2D MRFs provide a unified framework for early vision problems that are based on static image observations. 3D MRFs are suggested to cope with dynamic image data. To the contrary, DBNs are far less used for dynamic low level vision problems even though ...
متن کاملChaotic Genetic Algorithm based on Explicit Memory with a new Strategy for Updating and Retrieval of Memory in Dynamic Environments
Many of the problems considered in optimization and learning assume that solutions exist in a dynamic. Hence, algorithms are required that dynamically adapt with the problem’s conditions and search new conditions. Mostly, utilization of information from the past allows to quickly adapting changes after. This is the idea underlining the use of memory in this field, what involves key design issue...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Studia Logica
دوره 93 شماره
صفحات -
تاریخ انتشار 2009